A homomorphism theorem for bilinear multipliers

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A homomorphism theorem for bilinear multipliers

In this paper we prove an abstract homomorphism theorem for bilinear multipliers in the setting of locally compact Abelian (LCA) groups. We also provide some applications. In particular, we obtain a bilinear abstract version of K. de Leeuw’s theorem for bilinear multipliers of strong and weak type. We also obtain necessary conditions on bilinear multipliers on non-compact LCA groups, yielding b...

متن کامل

Bilinear multipliers and transference

(defined for Schwarzt test functions f and g in ) extends to a bounded bilinear operator from Lp1 (R)×Lp2 (R) into Lp3 (R). The theory of these multipliers has been tremendously developed after the results proved by Lacey and Thiele (see [16, 18, 17]) which establish that m(ξ,ν) = sign(ξ +αν) is a (p1, p2)-multiplier for each triple (p1, p2, p3) such that 1 < p1, p2 ≤∞, p3 > 2/3, and each α∈R \...

متن کامل

A Dichotomy Theorem for Homomorphism Polynomials

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H . We show that this family is computable by arithmetic circuits in constant depth if H has a loop or no edge and that it is hard otherwise (i.e., complete for VNP, the arithmetic class related to #P ). We...

متن کامل

A generalization of Martindale's theorem to $(alpha, beta)-$homomorphism

Martindale proved that under some conditions every multiplicative isomorphism between two rings is additive. In this paper, we extend this theorem to a larger class of mappings and conclude that every multiplicative $(alpha, beta)-$derivation is additive.

متن کامل

Bilinear Factorization via Augmented Lagrange Multipliers

This paper presents a unified approach to solve different bilinear factorization problems in Computer Vision in the presence of missing data in the measurements. The problem is formulated as a constrained optimization problem where one of the factors is constrained to lie on a specific manifold. To achieve this, we introduce an equivalent reformulation of the bilinear factorization problem. Thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the London Mathematical Society

سال: 2013

ISSN: 0024-6107

DOI: 10.1112/jlms/jdt043